Deduction-based Reenement Planning

We introduce a method of deduction-based re-nement planning where prefabricated general solutions are adapted to special problems. Re-nement proceeds by stepwise transforming non-constructive problem speciications into exe-cutable plans. For each reenement step there is a correctness proof guaranteeing the soundness of reenement and with that the generation of prov-ably correct plans. By solving the hard deduction problems once and for all on the abstract level, planning on the concrete level becomes more ef-cient. With that, our approach aims at making deductive planning feasible in realistic contexts. Our approach is based on a temporal logic framework that allows for the representation of spec-iications and plans on the same linguistic level. Basic actions and plans are speciied using a programming language the constructs of which are formulae of the logic. Abstract solutions are represented as|possibly recursive|procedures. It is this common level of representation and the uid transition between speciications and plans our reenement process basically relies upon.